. FA ] 1 4 Se p 20 05 Weighted generalized inverses , oblique projections and least squares problems ∗
نویسندگان
چکیده
A generalization with singular weights of Moore-Penrose generalized inverses of closed range operators in Hilbert spaces is studied using the notion of compatibility of subspaces and positive operators. ∗Partially supported by CONICET (PIP 2083/00), UBACYT I030 and ANPCYT (PICT03-9521)
منابع مشابه
Regularized Incomplete Oblique Projections Method for Solving Least-squares Problems in Image Reconstruction
METHOD FOR SOLVING LEAST-SQUARES PROBLEMS IN IMAGE RECONSTRUCTION H. D. Scolnik1 N. Echebest2 M.T. Guardarucci2 1 Departamento de Computación, Fac. de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina( [email protected]) 2 Departamento de Matemática, Facultad de Ciencias Exactas, Universidad Nacional de La Plata, Argentina ([email protected])
متن کاملApproximate Generalized Inverse Preconditioning Methods for Least Squares Problems
iv erative methods to solve least squares problems more efficiently. We especially focused on one kind of preconditioners, in which preconditioners are the approximate generalized inverses of the coefficient matrices of the least squares problems. We proposed two different approaches for how to construct the approximate generalized inverses of the coefficient matrices: one is based on the Minim...
متن کاملCramer's Rule for Generalized Inverse Solutions of Some Matrices Equations
By a generalized inverse of a given matrix, we mean a matrix that exists for a larger class of matrices than the nonsingular matrices, that has some of the properties of the usual inverse, and that agrees with inverse when given matrix happens to be nonsingular. In theory, there are many different generalized inverses that exist. We shall consider the Moore Penrose, weighted Moore-Penrose, Draz...
متن کاملThe application of an oblique-projected Landweber method to a model of supervised learning
This report brings together a novel approach to some computer vision problems and a particular algorithmic development of the Landweber iterative algorithm. The algorithm solves a class of high-dimensional, sparse, and constrained least-squares problems, which arise in various computer vision learning tasks, such as object recognition and object pose estimation. The algorithm has recently been ...
متن کاملBeyond Moore-Penrose Part II: The Sparse Pseudoinverse
This is the second part of a two-paper series on norm-minimizing generalized inverses. In Part II we focus on generalized inverses that are minimizers of entrywise ` norms, with the main representative being the sparse pseudoinverse for p = 1. We are motivated by the idea to replace the Moore-Penrose pseudoinverse by a sparser generalized inverse which is in some sense well-behaved. Sparsity me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005